Extensible Spherical Fibonacci Grids

Spherical Fibonacci grids (SFG) yield extremely uniform point set distributions on the sphere. This feature makes SFGs particularly well-suited to a wide range of computer graphics applications, from numerical integration, vector quantization, among others. However, application problems in which further refinement an initial is required currently not possible. because there no solution problem adding new points existing SFG while maintaining properties. In this work, we fill gap by proposing extensible spherical (E-SFG). We start carrying out formal analysis identify properties make these sets exhibit nearly-optimal distribution. Then, propose algorithm (E-SFG) extend original preserving Finally, compare E-SFG with other sets. Our results show that outperforms based low discrepancy sequence both terms cap and root mean squared error for evaluating rendering integral.